Improved upper bounds in the moving sofa problem

نویسندگان

  • Yoav Kallus
  • Dan Romik
  • Joseph Gerver
چکیده

The moving sofa problem, posed by L. Moser in 1966, asks for the planar shape of maximal area that can move around a right-angled corner in a hallway of unit width. It is known that a maximal area shape exists, and that its area is at least 2.2195 . . .—the area of an explicit construction found by Gerver in 1992—and at most 2 √ 2 ≈ 2.82, with the lower bound being conjectured as the true value. We prove a new and improved upper bound of 2.37. The method involves a computer-assisted proof scheme that can be used to rigorously derive further improved upper bounds that converge to the correct value.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solving the Single Machine Problem with Quadratic Earliness and Tardiness Penalties

  Nowadays, scheduling problems have a considerable application in production and service systems. In this paper, we consider the scheduling of n jobs on a single machine assuming no machine idleness, non-preemptive jobs and equal process times. In many of previous researches, because of the delivery dalays and holding costs, earliness and tardiness penalties emerge in the form of linear combin...

متن کامل

Upper bounds for noetherian dimension of all injective modules with Krull dimension

‎In this paper we give an upper bound for Noetherian dimension of all injective modules with Krull dimension on arbitrary rings‎. ‎In particular‎, ‎we also give an upper bound for Noetherian dimension of all Artinian modules on Noetherian duo rings.

متن کامل

Lower and Upper Bounds for Tracking Mobile Users

In this paper we prove improved lower and upper bounds for the location of mobile facilities (in L∞ and L2 metrics) under the motion of clients when facility moves faster than clients. This paper continues the research started in our joint paper where we present lower bounds and efficient algorithms for exact and approximate maintenance of the 1center for a set of moving points in the plane. Ou...

متن کامل

A Non-linear Integer Bi-level Programming Model for Competitive Facility Location of Distribution Centers

The facility location problem is a strategic decision-making for a supply chain, which determines the profitability and sustainability of its components. This paper deals with a scenario where two supply chains, consisting of a producer, a number of distribution centers and several retailers provided with similar products, compete to maintain their market shares by opening new distribution cent...

متن کامل

An Efficient Algorithm for Reducing the Duality Gap in a Special Class of the Knapsack Problem

A special class of the knapsack problem is called the separable nonlinear knapsack problem. This problem has received considerable attention recently because of its numerous applications. Dynamic programming is one of the basic approaches for solving this problem. Unfortunately, the size of state-pace will dramatically increase and cause the dimensionality problem. In this paper, an efficient a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017